An efficient greedy scheduler for zero-forcing dirty-paper coding
نویسندگان
چکیده
منابع مشابه
On " Dirty-paper Coding "
regardless of what Q is. The title of Costa’s work came by making an analogy to the problem of writing on dirty paper, where the reader cannot nominally distinguish dirt from ink. There are many scenarios where this result may be applied. In the field of information hiding (or watermarking), a message is encoded in u, which is to be embedded in the host waveform i using the signal s. Data compr...
متن کاملTwo-Level Dirty Paper Coding
We propose a two-level coding and successive decoding for dirty paper coding (DPC). We divide the channel code into two levels, the upper code interacting with the shaping code and the lower code that does not, such that it is information lossless. Furthermore, the code design becomes more intuitive and its analysis becomes clearer since the lower code can be designed using any conventional cod...
متن کاملDirty Paper Coding with Partial State Information
A generalization of the problem of dirty paper coding is considered in which (possibly different) noisy versions of the state information, assumed to be i.i.d. Gaussian random variables, are available at the encoder and at the decoder. This paper derives the maximum achievable rate formula for this general problem. This general setup encompasses the cases where the state information is perfectl...
متن کاملDirty-Paper Coding for the Multi-Access Channel with Conferencing
We derive the capacity region of the two-user dirtypaper Gaussian multi-access channel (MAC) with conferencing encoders. In this MAC, prior to each transmission block, the transmitters can hold a conference in which they can communicate with each other over error-free bit-pipes of given capacities. The received signal suffers not only from additive Gaussian noise but also from additive interfer...
متن کاملA Practical Dirty Paper Coding Applicable for Broadcast Channel
In this paper, we present a practical dirty paper coding scheme using trellis coded modulation for the dirty paper channel Y = X+S+W, E{X} ≤ P , where W is white Gaussian noise with power σ w, P is the average transmit power and S is the Gaussian interference with power σ s that is non-causally known at the transmitter. We ensure that the dirt in our scheme remains distinguishable to the receiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2009
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2009.07.070162